Simulated annealing heuristics for the dynamic facility layout problem
نویسندگان
چکیده
منابع مشابه
Simulated annealing heuristics for the dynamic facility layout problem
In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in product mix and demand. Therefore, this paper considers the problem of arranging and rearranging (when there are changes between the flows of materials between departments) manufacturing facilities such that sum of the material handling and rearrangement costs are minimized. This probl...
متن کاملMulti-start simulated annealing for dynamic plant layout problem
In today’s dynamic market, organizations must be adaptive to market fluctuations. In addition, studies show that material-handling cost makes up between 20 and 50 percent of the total operating cost. Therefore, this paper considers the problem of arranging and rearranging, when there are changes in product mix and demand, manufacturing facilities such that the sum of material handling and rearr...
متن کاملA Hybrid Simulated Annealing algorithm for Single Row Facility Layout Problem
This article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. Regarding the NP-Hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. A number of test problems are randomly generat...
متن کاملmulti-start simulated annealing for dynamic plant layout problem
in today’s dynamic market, organizations must be adaptive to market fluctuations. in addition, studies show that material-handling cost makes up between 20 and 50 percent of the total operating cost. therefore, this paper considers the problem of arranging and rearranging, when there are changes in product mix and demand, manufacturing facilities such that the sum of material handling and rearr...
متن کاملA solution to the facility layout problem using simulated annealing
Ž . In this paper a solution in the continual plane to the Facility Layout Problem FLP is presented. It is based on Simulated Ž . Annealing SA , a relatively recent algorithm for solving hard combinatorial optimization problems, like FLP. This approach Ž . may be applied either in General Facility Layout Problems GFLP considering facilities areas, shapes and orientations or in Ž . Machine Layou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2006
ISSN: 0305-0548
DOI: 10.1016/j.cor.2005.02.021